A Multi–Objective Gaining–Sharing Knowledge-Based Optimization Algorithm for Solving Engineering Problems

نویسندگان

چکیده

Metaheuristics in recent years has proven its effectiveness; however, robust algorithms that can solve real-world problems are always needed. In this paper, we suggest the first extended version of recently introduced gaining–sharing knowledge optimization (GSK) algorithm, named multiobjective (MOGSK), to deal with (MOPs). MOGSK employs an external archive population store nondominated solutions generated thus far, aim guiding during exploration process. Furthermore, fast sorting crowding distance was incorporated sustain diversity and ensure convergence towards Pareto optimal set, while ϵ-dominance relation used update solutions. helps provide a good boost diversity, coverage, overall. The validation proposed conducted using five biobjective (ZDT) seven three-objective test functions (DTLZ) problems, along CEC 2021, fifty-five total, including power electronics, process design synthesis, mechanical design, chemical engineering, system optimization. compared existing algorithms, MOEAD, eMOEA, MOPSO, NSGAII, SPEA2, KnEA, GrEA. experimental findings show behavior our against comparative particular problems.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems

These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...

متن کامل

Multiobjective Evolutionary Algorithm Approach For Solving Integer Based Optimization Problems

Multiobjective Evolutionary algorithms (MOEAs) are often well-suited for complex combinatorial Multiobjective optimization problems (MOPs). Integer based MOPs are prevalent in real world applications where there exist a discrete amount of a component or quantity of an item. Presented here is the application of a building block based MOEA, the MOMGA-II, to a NP Complete problem and real-world ap...

متن کامل

Solving Multiobjective Optimization Problems using Evolutionary Algorithm

Being capable of finding a set of pareto–optimal solutions in a single run, which is a necessary feature for multi–criteria decision making, Evolutionary Algorithms (EAs) has attracted many researchers and practitioners to address the solution of Multiobjective Optimization Problems (MOPs). In a previous work, we developed a Pareto Differential Evolution (PDE) algorithm to handle multiobjective...

متن کامل

EFFICIENCY OF IMPROVED HARMONY SEARCH ALGORITHM FOR SOLVING ENGINEERING OPTIMIZATION PROBLEMS

Many optimization techniques have been proposed since the inception of engineering optimization in 1960s. Traditional mathematical modeling-based approaches are incompetent to solve the engineering optimization problems, as these problems have complex system that involves large number of design variables as well as equality or inequality constraints. In order to overcome the various difficultie...

متن کامل

Flying Squirrel Optimizer (FSO): A novel SI-based optimization algorithm for engineering problems

This paper provides a novel meta-heuristic optimization algorithm. The behaviors of flying squirrels in the nature are the main inspiration of this research. These behaviors include flying from tree to tree and walking on the ground or on a tree branch to find food. They also contact each other with chirp or squeak. This algorithm is named flying squirrel optimizer (FSO). Two main theories of m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2023

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math11143092